γ-Brass Polyhedral Core in Intermetallics: The Nanocluster Model

Polyhedral Model

SPolly: Speculative Optimizations in the Polyhedral Model

The polyhedral model is only applicable to code regions that form static control parts (SCoPs) or slight extensions thereof. To apply polyhedral techniques to a piece of code, the compiler usually checks, by static analysis, whether all SCoP conditions are fulfilled. However, in many codes, the compiler fails to verify that this is the case. In this paper we investigate the rejection causes as ...

Phased Computation Graphs in the Polyhedral Model

We present a translation scheme that allows a broad class of dataflow graphs to be considered under the optimization framework of the polyhedral model. The input to our analysis is a Phased Computation Graph, which we define as a generalization of the most widely used dataflow representations, including synchronous dataflow, cyclo-static dataflow, and computation graphs. The output of our analy...

The γ-Core and Coalition Formation

This paper reinterprets the γ -core (Chander and Tulkens (1995, 1997)) and justifies it as well as its prediction that the efficient coalition structure is stable in terms of the coalition formation theory. It is assumed that coalitions can freely merge or break apart, are farsighted (that is, it is the final and not the immediate payoffs that matter to the coalitions) and a coalition may devia...

On Code-Generation in the Polyhedral Model

Automatic parallelization in the polyhedral model is based on aane transformations from an original computation domain (iteration space) to a target space-time domain, often with a diierent transformation for each variable. Code generation is an often ignored step in this process that has a signiicant impact on the quality of the nal code. Previous code generation methods are based on loop spli...